Cooperative Routing and Scheduling of an Electric Vehicle Fleet Managing Dynamic Customer Requests
نویسندگان
چکیده
Environmental issues and consumer concerns have paved the way for governments to legislate and help usher into operation alternativefueled vehicles and pertinent infrastructures. In the last decade, batterypowered electric vehicles have been introduced and the service industry has followed suit and deployed such trucks in their distribution networks. However, electric vehicles do impose limitations when it comes to their traveling range. Replenishing the power to the vehicle batteries may entail lengthy charging visits at respective stations. In this paper, we examine the problem of routing and scheduling a fleet of electric vehicles that seek to satisfy dynamic pickup and delivery requests in an urban environment. We develop a web application to facilitate cooperation between organizations and individuals involved in urban freight transport. The application uses geolocation services and mobile devices to help manage the fleet and make timely decisions. Moreover, we propose three heuristic recharging strategies to ensure that electric vehicles can restore their energy levels in an effective manner. Through detailed experimentation, we show that the costs associated with the use of an electric vehicle fleet concern mainly the size of the fleet. The impact regarding the total route length traveled is less evident for all our strategies.
منابع مشابه
A green vehicle routing problem with customer satisfaction criteria
This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملCentralized fleet management system for cybernetic transportation
In this article, we present a centralized fleet management system (CFMS) for cybernetic vehicles called cybercars. Cybercars are automatically guided vehicles for passenger transport on dedicated networks like amusement parks, shopping centres etc. The users make reservations for the vehicles through phone, internet, kiosk etc and the CFMS schedules the cybercars to pick the users at their resp...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملTwo phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction
Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...
متن کامل